原題鏈接在這里：https://leetcode.com/problems/path-with-maximum-minimum-value/ 題目： Given a matrix of integ ...

Union Find算法基礎 Union Find算法用於處理集合的合並和查詢問題，其定義了兩個用於並查集的操作： Find: 確定元素屬於哪一個子集，或判斷兩個元素是否屬於同一子集 U ...

原題鏈接在這里：https://leetcode.com/problems/connecting-cities-with-minimum-cost/ 題目： There are N cities ...

Union Find Princeton's lecture note on Union Find in Algorithms and Data Structures It is a ...

Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), ...

Use Union Find to figure out the number of connected components ...

There are N students in a class. Some of them are friends, while some are not. Their friendship is t ...

原題鏈接在這里：https://leetcode.com/problems/lexicographically-smallest-equivalent-string/ 題目： Given stri ...

圖基礎 圖(Graph)應用廣泛，程序中可用鄰接表和鄰接矩陣表示圖。依據不同維度，圖可以分為有向圖/無向圖、有權圖/無權圖、連通圖/非連通圖、循環圖/非循環圖，有向圖中的頂點具有入度/出度的概念。 ...

Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), ...